Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
41	Interactive Design Exploration for Constrained Meshes Bailin Deng∗, Sofien Bouaziz, Mario Deuss, Alexandre Kaspar, Yuliy Schwartzburg, Mark Pauly Computer Graphics and Geometry Laboratory, EPFL, CH-1015 Lausanne, Switz Add to Reading List Source URL: www.bdeng.me Language: English - Date: 2016-04-27 10:38:05 Mathematical optimization Mathematical analysis Analysis Mathematics Shape optimization Constraint Constrained optimization Feasible region Optimization problem Lagrange multiplier Penalty method
42	COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used Add to Reading List Source URL: www.amsterdamoptimization.com Language: English - Date: 2011-03-16 12:56:11 Operations research Mathematics Mathematical analysis Computational complexity theory Knapsack problem Cutting stock problem Dynamic programming Pi Linear programming Mathematical optimization Column generation
43	Deterministic global optimization using the Lipschitz condition Yaroslav D. Sergeyev University of Calabria, Rende, Italy and N.I. Lobatchevsky University of Nizhni Novgorod, Russia Via P. Bucci, Cubo 42-C Add to Reading List Source URL: conf.nsc.ru Language: English - Date: 2012-04-27 02:07:25 Mathematical optimization Global optimization Deterministic global optimization Optimization problem Analysis Applied mathematics Operations research Evolutionary multimodal optimization
44	History dependent public policies David Evans ∗ Thomas J. Sargent‡† Add to Reading List Source URL: www.tomsargent.com Language: English - Date: 2015-04-08 13:04:02 Computing Software Computer programming Equations Mathematical optimization Application programming interfaces Bellman equation Control theory Dynamic programming Qt P22 Ramsey problem
45	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
46	CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves∗ Tim Roughgarden† November 5, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-29 15:44:35 Operations research Mathematical optimization Mathematics Packing problems Mathematical analysis Academia Cryptography Knapsack problem Multi-objective optimization Pareto efficiency Probability distribution Pareto distribution
47	1 CrowdOp: Query Optimization for Declarative Crowdsourcing Systems Ju Fan, Meihui Zhang, Stanley Kok, Meiyu Lu, and Beng Chin Ooi Abstract—We study the query optimization problem in declarative crowdsourcing systems. Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2015-03-19 06:59:18 Data management Computing Software Database management systems SQL Mathematical optimization Operations research Database theory Query optimization Query plan Crowdsourcing Multi-objective optimization
48	239 Documenta Math. Ronald Graham: Laying the Foundations of Online Optimization Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:25:05 Scheduling Operations research Mathematics Applied mathematics Computer science Makespan Online algorithm Job Competitive analysis Algorithm Optimization problem Job shop scheduling
49	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Geometry Computer science Search algorithms Discrete geometry Computational geometry Mathematical optimization Closest pair of points problem Nearest neighbor search Nearest neighbor graph K-nearest neighbors algorithm Euclidean minimum spanning tree
50	Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-30 16:37:02 Mathematics Graph theory Matching Discrete mathematics Combinatorics Cooperative games Game theory Combinatorial optimization Stable marriage problem Stable roommates problem 3-dimensional matching